Solving resultant form equations over number fields
نویسندگان
چکیده
منابع مشابه
Solving resultant form equations over number fields
We give an efficient algorithm for solving resultant form equations over number fields. This is the first time that such equations are completely solved by reducing them to unit equations in two variables.
متن کاملSolving sparse linear equations over finite fields
Ahstruct-A “coordinate recurrence” method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all require O( n,( w + nl) logkn,) field operations, where nI is the maximum dimension of the coefficient matrix, w is approximately the number of field operations required to apply the matrix to a test vector, and the value of k depends on the algor...
متن کاملOn solving relative norm equations in algebraic number fields
Let Q ⊆ E ⊆ F be algebraic number fields and M ⊂ F a free oE -module. We prove a theorem which enables us to determine whether a given relative norm equation of the form |NF/E (η)| = |θ| has any solutions η ∈ M at all and, if so, to compute a complete set of nonassociate solutions. Finally we formulate an algorithm using this theorem, consider its algebraic complexity and give some examples.
متن کاملSolving norm equations in relative number fields using S-units
In this paper, we are interested in solving the so-called norm equation NL/K(x) = a, where L/K is a given arbitrary extension of number fields and a a given algebraic number of K. By considering S-units and relative class groups, we show that if there exists at least one solution (in L, but not necessarily in ZL), then there exists a solution for which we can describe precisely its prime ideal ...
متن کاملSolving systems of diagonal polynomial equations over finite fields
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the polynomial equations. Our algorithm works in time polynomial in the number of equations and the logarithm of the size of the field, whenever the degree of the pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2008
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-08-02141-8